Some Accepting Powers of Three-Dimensional Synchronized Alternating Turing Machines
نویسنده
چکیده
This paper introduces a three-dimensional synchronized alternating Turing machine (3-SATM), and investigates fundamental properties of 3-SATM ′s whose input tapes are restricted to cubic ones. The main topics of this paper are: (1) a relationship between the accepting powers of 3-SATM ′s and three-dimensional alternating Turing machines with small space bounds, (2) a relationship between the accepting powers of five-way and six-way 3-SATM ′s, (3) a relationship between the accepting powers of 3-SATM ′s and three-dimensional nondeterministic Turing machines.
منابع مشابه
Four-Dimensional Synchronized Alternating Turing Machines
Synchronized alternating machine is an alternating machine with a special subset of internal states called synchronizing states. This paper introduces a four-dimensional synchronized alternating Turing machine (4-SATM ), and investigates fundamental properties of 4-SATM ’s. The main topics of this paper are: (1) a relationship between the accepting powers of 4-SATM ’s and four-dimensional alter...
متن کاملSynchronized Alternating Turing Machines on Four-Dimensional Input Tapes
Synchronized alternating machine is an alternating machine with a special subset of internal states called synchronizing states. This paper introduces a four-dimensional synchronized alternating Turing machine (4-SATM ), and investigates fundamental properties of 4-SATM ’s. The main topics of this paper are: (1) a relationship between the accepting powers of 4-SATM ’s and four-dimensional alter...
متن کاملConstant Leaf-Size Hierarchy of Two-Dimensional Alternating Turing Machines
‘Leaf-size’ (or ‘branching’) is the minimum number of leaves of some accepting computation trees of alternating devices. For example, one leaf corresponds to nondeterministic computation. In this paper, we investigate the effect of constant leaves of three-dimensional alternating Turing machines, and show the following facts : (1) For cubic input tapes, k leafand L(m) space-bounded three-dimens...
متن کاملSome improvements in fuzzy turing machines
In this paper, we improve some previous definitions of fuzzy-type Turing machines to obtain degrees of accepting and rejecting in a computational manner. We apply a BFS-based search method and some level’s upper bounds to propose a computational process in calculating degrees of accepting and rejecting. Next, we introduce the class of Extended Fuzzy Turing Machines equipped with indeterminacy s...
متن کاملSome Results about Hierarchy and Recognizability of Four-Dimensional Synchronized Alternating Turing Machines
The recent advances in computer animation, motion image processing, robotics and so on prompted us to analyze computational complexity of four-dimensional pattern processing. Thus, the research of four-dimensional automata as a computational model of four-dimensional pattern processing has also been meaningful. From this viewpoint, we introduced a four-dimensional alternating Turing machine (4-...
متن کامل